package com.kfm.base.loop;

public class NNDemo {

    public static void main(String[] args) {
        /*
           9 9 乘法表

            i = 0 ;  i0-j0  i0-j1  i0-j2 i0-j3
            i = 1 ;  i1-j0  i1-j1  i1-j2 i1-j3
            i = 2 ;  i2-j0  i2-j1  i2-j2 i2-j3
         */
        for (int i = 1;
             i <= 9;
             i ++){

            for (int j = 1;
                 j < 10;
                 j ++){

                System.out.print(i + " * " + j + " = " + i * j + "\t");
            }
            // 换行
            System.out.println();
        }
    }
}
